Efficient cooperation by exchanging favors
نویسندگان
چکیده
منابع مشابه
The risk of predation favors cooperation among breeding prey.
Empirical studies have shown that animals often focus on short-term benefits under conditions of predation risk, which reduces the likelihood that they will cooperate with others. However, some theoretical studies predict that animals in adverse conditions should not avoid cooperation with their neighbors since it may decrease individual risks and increase long-term benefits of reciprocal help....
متن کاملSpatial self-organization favors heterotypic cooperation over cheating
Heterotypic cooperation-two populations exchanging distinct benefits that are costly to produce-is widespread. Cheaters, exploiting benefits while evading contribution, can undermine cooperation. Two mechanisms can stabilize heterotypic cooperation. In 'partner choice', cooperators recognize and choose cooperating over cheating partners; in 'partner fidelity feedback', fitness-feedback from rep...
متن کاملSorting by Exchanging
We adopt the following convention: α, β, γ, δ denote ordinal numbers, k denotes a natural number, and x, y, z, t, X, Y , Z denote sets. The following propositions are true: (1) x ∈ (α+ β) \ α iff there exists γ such that x = α+ γ and γ ∈ β. (2) Suppose α ∈ β and γ ∈ δ. Then γ 6= α and γ 6= β and δ 6= α and δ 6= β or γ ∈ α and δ = α or γ ∈ α and δ = β or γ = α and δ ∈ β or γ = α and δ = β or γ =...
متن کاملOn Learning by Exchanging Advice
One of the main questions concerning learning in Multi-Agent Systems is: ”(How) can agents benefit from mutual interaction during the learning process?”. This paper describes the study of an interactive advice-exchange mechanism as a possible way to improve agents’ learning performance. The advice-exchange technique, discussed here, uses supervised learning (backpropagation), where reinforcemen...
متن کاملPrefix Exchanging and Pattern Avoidance by Involutions
Let In(π) denote the number of involutions in the symmetric group Sn which avoid the permutation π. We say that two permutations α, β ∈ Sj may be exchanged if for every k and ordering τ of j + 1, . . . , k, we have In(ατ) = In(βτ) for every n. Here we prove that 12 and 21 may be exchanged and that 123 and 321 may be exchanged. The first of these theorems gives a number of known results for patt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Economics
سال: 2018
ISSN: 1933-6837
DOI: 10.3982/te2771